The Maximum Degree & Diameter-Bounded Subgraph and its Applications

We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications in security, network design and parallel processing, and in connection with the latter we derive some bounds for the order of the largest subgraph in host graphs of practical interest: the mesh and the hypercube. We also present a heuristic strategy to solve the problem, and we prove an approximation ratio for the algorithm. Finally, we provide some experimental results with a variety of host networks, which show that ∗[email protected] †[email protected] ‡[email protected] §[email protected] the algorithm performs better in practice than the prediction provided by our theoretical approximation ratio.